A New Genetic Coding for Job Shop Scheduling Problem Considering Geno Type and Pheno Type
نویسندگان
چکیده
Job shop scheduling problem is one of the most important problems in the combinatorial optimization problems, and it is applied to various fields about engineering. Many works have been reported for this problem using Genetic Algorithm (GA). The GA is one of the most powerful optimization methods based on the mechanics of natural evolution. In this paper, we propose a new genetic coding for the job shop scheduling problem. The proposed genetic coding improves the search performance while keeping the run time in comparison with the conventional one. Simulation results using benchmark data prove the validity of the proposed genetic coding comparison with the conventional one. Key-Words: Genetic Algorithm, Coding method, Job shop Scheduling Problem, Scheduling priority, Geno type, Pheno type
منابع مشابه
A Mathematical Programming Model for Flow Shop Scheduling Problems for Considering Just in Time Production
In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کاملA New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملVirtual manufacturing cells scheduling considering lotstreaming and sequence dependent setup times
In this paper, a new mathematical model for the problem of job scheduling in virtual manufacturing cells (VMC) is presented to minimizing the completion time of all jobs. Sequence dependent setup times of machines is considered and lot-streaming is possible. In Virtual manufacturing cells, each job has a different processing path and there is a set of machines for processing each operation. The...
متن کاملModelling and solving the job shop scheduling Problem followed by an assembly stage considering maintenance operations and access restrictions to machines
This paper considers job shop scheduling problem followed by an assembly stage and Lot Streaming (LS). It is supposed here that a number of products have been ordered to be produced. Each product is assembled with a set of several parts. The production system includes two stages. The first stage is a job shop to produce parts. Each machine can process only one part at the same time. The second ...
متن کامل